An FPTAS for Knapsack , and K - Center
نویسندگان
چکیده
منابع مشابه
An FPTAS for the parametric knapsack problem
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problemmay need to output an exponential number of knapsack solutions. We present a fully polynomial-time approximation scheme (FPTAS...
متن کاملInteger knapsack problems with set-up weights
The Integer Knapsack Problem with Set-up Weights (IKPSW) is a generalization of the classical Integer Knapsack Problem (IKP), where each item type has a set-up weight that is added to the knapsack if any copies of the item type are in the knapsack solution. The k-item IKPSW (kIKPSW) is also considered, where a cardinality constraint imposes a value k on the total number of items in the knapsack...
متن کاملA Faster FPTAS for the Unbounded Knapsack Problem
The Unbounded Knapsack Problem (UKP) is a well-known variant of the famous 0-1 Knapsack Problem (0-1 KP). In contrast to 0-1 KP, an arbitrary number of copies of every item can be taken in UKP. Since UKP is NP-hard, fully polynomial time approximation schemes (FPTAS) are of great interest. Such algorithms find a solution arbitrarily close to the optimum OPT(I), i.e. of value at least (1− ε)OPT(...
متن کاملA Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheless, our methodology focuses on very general techniques (such as dominance relations in dynamic programming) and thus may be applicable in the implementation of fptas for other problems as well. Extensive numerical experiments on...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Computing Knapsack Solutions with Cardinality Robustness
In this paper, we study the robustness over the cardinality variation for the knapsack problem. For the knapsack problem and a positive number α ≤ 1, we say that a feasible solution is α-robust if, for any positive integer k, it includes an α-approximation of the maximum k-knapsack solution, where a k-knapsack solution is a feasible solution that consists of at most k items. In this paper, we s...
متن کامل